from typing import *
from heapq import heappop,heappush

class Solution:
    def findXSum(self, nums: List[int], k: int, x: int) -> List[int]:

        n = len(nums)
        x,y = [],[]
        sx,sy = set(),set()
        cur = 0
        ans = []
        h = DefaultDict(int)
        for i,v in enumerate(nums):
            h[v] += 1
            if len(x) < x:
                if x not in sx:
                    heappush(x,)
            if i >= k - 1:
                
            
        
        return ans

s = Solution()
print(s.findXSum(nums=[1, 1, 2, 2, 3, 4, 2, 3], k=6, x=2))
